Rapid mixing of Gibbs sampling on graphs that are sparse on average
نویسندگان
چکیده
منابع مشابه
Ensuring Rapid Mixing and Low Bias for Asynchronous Gibbs Sampling
Gibbs sampling is a Markov chain Monte Carlo technique commonly used for estimating marginal distributions. To speed up Gibbs sampling, there has recently been interest in parallelizing it by executing asynchronously. While empirical results suggest that many models can be efficiently sampled asynchronously, traditional Markov chain analysis does not apply to the asynchronous case, and thus asy...
متن کاملMixing Rates for Gibbs Sampling
Proof. Let x, y 2 ⌦ be two configurations. We will prove the claim for the visible conditional distributions. The proof for the hidden conditional distributions will follow symmetrically. For each visible node v i , let (X(v i ), Y (v i )) be the maximal coupling of P (v)(X(v i ) |x(h)) and P (v)(Y (v i ) | y(h)) guaranteed in Lemma 1. By doing this independently for all visible nodes, we have ...
متن کاملGibbs Measures and Phase Transitions on Sparse Random Graphs
Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years, considerable progress has been achieved by viewing these distributions as Gibbs measures and applying to their study heuristic tools from statistical physics. We review...
متن کاملOn particle Gibbs sampling
The particle Gibbs sampler is a Markov chain Monte Carlo (MCMC) algorithm to sample from the full posterior distribution of a state-space model. It does so by executing Gibbs sampling steps on an extended target distribution defined on the space of the auxiliary variables generated by an interacting particle system. This paper makes the following contributions to the theoretical study of this a...
متن کاملOn the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2009
ISSN: 1042-9832
DOI: 10.1002/rsa.20276